The two variable per inequality abstract domain
نویسندگان
چکیده
منابع مشابه
The two variable per inequality abstract domain
This article presents the Two Variable Per Inequality abstract domain (TVPI domain for short). This so-called weakly-relational domain is able to express systems of linear inequalities where each inequality has at most two variables. The domain represents a sweet-point in the performance-cost tradeoff between the faster Octagon domain and the more expressive domain of general convex polyhedra. ...
متن کاملThe Two Variable Per Inequality
This article presents the Two Variable Per Inequality abstract domain (TVPI domain for short). This so-called weakly-relational domain is able to express systems of linear inequalities where each inequality has at most two variables. The domain represents a sweet-point in the performance-cost tradeoff between the faster Octagon domain and the more expressive domain of general convex polyhedra. ...
متن کاملTwo Variables per Linear Inequality as an Abstract Domain
Domain Axel Simon Andy King Jacob M. Howe Computing Laboratory, Department of Computing, University of Kent, Canterbury, UK. City University, London, UK. {a.m.king, a.simon}@ukc.ac.uk [email protected] Abstract. This paper explores the spatial domain of sets of inequalities where each inequality contains at most two variables – a domain that is richer than intervals and more tractable than g...
متن کاملA Case for Strongly Polynomial Time Sub-Polyhedral Scheduling Using Two-Variable-Per-Inequality Polyhedra
We make a case for sub-polyhedral scheduling using (Unit-)TwoVariable-Per-Inequality or (U)TVPI Polyhedra. We empirically show that using general convex polyhedra leads to a scalability problem in a widely used polyhedral scheduler. We propose methods in which polyhedral schedulers can beat the scalability challenge by using sub-polyhedral under-aproximations of the polyhedra resulting from the...
متن کاملA Unit Two Variable per Inequality Integer Constraint Solver for Constraint Logic Programming
One of the problems with the traditional nite domains approach to solving integer problems in a constraint logic programming context is that all variables require explicit bounds. If no explicit bounds are available then the nite domain solver can be very ineecient on certain classes of problem. We present an alternative approach to solving integer constraints based on a polynomial-time solver ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Higher-Order and Symbolic Computation
سال: 2010
ISSN: 1388-3690,1573-0557
DOI: 10.1007/s10990-010-9062-8